Heuristics as Grammar
نویسندگان
چکیده
Computationally feasible accounts of complex linguistic phenomena (such as discontinuity, ellipsis, etc.) usually require additional, complex grammatical resources together with parsing heuristics to mitigate computational overhead. We claim that certain kinds of knowledge usually expressed as heuristics can be seen as declarative grammar knowledge if a default interpretation is given to grammar rules. We show that such interpretation cannot be given by any variant of default uni-cation, but it can be provided by a dynamic binding process interfacing grammar rules and standard parsing techniques. As a case study, we reformulate a categorial approach to non-constituent coordination and (multiple) gapping. Our set of four default grammar rules keeps the decla-rativity of the original approach, but also admits standard context-free parsing techniques, drastically reducing the search space.
منابع مشابه
Heuristics and Parse Ranking
There are currently two philosophies for building grammars and parsers – Statistically induced grammars and Wide-coverage grammars. One way to combine the strengths of both approaches is to have a wide-coverage grammar with a heuristic component which is domain independent but whose contribution is tuned to particular domains. In this paper, we discuss a three-stage approach to disambiguation i...
متن کاملUsing Categorial Grammar to Label Translation Rules
Adding syntactic labels to synchronous context-free translation rules can improve performance, but labeling with phrase structure constituents, as in GHKM (Galley et al., 2004), excludes potentially useful translation rules. SAMT (Zollmann and Venugopal, 2006) introduces heuristics to create new non-constituent labels, but these heuristics introduce many complex labels and tend to add rarely-ap...
متن کاملEvolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework (GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as an online learning method which evolves heuristics while solving the problem. In other words, the system keeps on evolving heuristics for a problem instance until a good solution is found. The framework is tested on so...
متن کاملEvolving Effective Incremental Solvers for Sat with a Hyper-heuristic Framework Based on Genetic Programming
Hyper-heuristics could simply be defined as heuristics to choose other heuristics. In other words, they are methods for combining existing heuristics to generate new ones. In this paper, we use a grammar-based genetic programming hyperheuristic framework. The framework is used for evolving effective incremental solvers for SAT. The evolved heuristics perform very well against well-known local s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007